Posets of shuffles

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Shuffles and Synchronized Shuffles: A Survey

We present an overview of different approaches to define shuffles and synchronized shuffles of words. The shuffle operations considered are distinguished by conditions according to which certain occurrences of symbols common to the original words may or must be identified (synchronized). The words that are shuffled may be infinite which leads to the possibility of unfair shuffling. In addition ...

متن کامل

Rapid mixing of dealer shuffles and clumpy shuffles

A famous result of Bayer and Diaconis [2] is that the Gilbert-Shannon-Reeds (GSR) model for the riffle shuffle of n cards mixes in 3 2 log2 n steps and that for 52 cards about 7 shuffles suffices to mix the deck. In this paper, we study variants of the GSR shuffle that have been proposed to model more realistically how people actually shuffle a deck of cards. The clumpy riffle shuffle and deale...

متن کامل

Mixable Shuffles, Quasi-shuffles and Hopf Algebras

The quasi-shuffle product and mixable shuffle product are both generalizations of the shuffle product and have both been studied quite extensively recently. We relate these two generalizations and realize quasi-shuffle product algebras as subalgebras of mixable shuffle product algebras. As an application, we obtain Hopf algebra structures in free Rota-Baxter algebras.

متن کامل

Quasi-shuffles, Mixable Shuffles and Hopf Algebras

The quasi-shuffle product and mixable shuffle product are both generalizations of the shuffle product and have both been studied quite extensively recently. We relate these two generalizations and realize quasi-shuffle product algebras as subalgebras of mixable shuffle product algebras. This allows us to extend a previous result of Hopf algebra structure on Baxter algebras.

متن کامل

Synchronized shuffles

Weextend the basic shuffle onwords and languages, awell-known operation in theoretical computer science, by introducing three synchronized shuffles. These synchronized shuffles have some relevance to molecular biology since they may be viewed as the formal representations of various forms of gene linkage during genome shuffling. More precisely, each synchronized shuffle preserves the genetic ba...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 1988

ISSN: 0097-3165

DOI: 10.1016/0097-3165(88)90018-0